Comparing community structure identification
نویسندگان
چکیده
منابع مشابه
Comparing community structure identification
We compare recent approaches to community structure identification in terms of sensitivity and computational cost. The recently proposed modularity measure is revisited and the performance of the methods as applied to ad hoc networks with known community structure, is compared. We find that the most accurate methods tend to be more computationally expensive, and that both aspects need to be con...
متن کاملCommunity structure identification
We review and compare recent approaches to community structure identification. Definitions of communities are revisited, as well as the recently proposed modularity measure. We then classify the various methods into link removal methods, agglomerative methods, methods based on optimising the modularity measure, spectral methods and others. Finally, the performance of the methods, as applied to ...
متن کاملComparing Online Community Structure of Patients of Chronic Diseases
In this paper we compare the social network structure of people talking about Crohn’s disease, Cystic Fibrosis, and Type 1 diabetes on Facebook and Twitter. We find that the Crohn’s community’s contributors are most emotional on Facebook and Twitter and most negative on Twitter, while the T1D community’s communication network structure is most cohesive. INTRODUCTION Social media has become a ma...
متن کاملComparing Community Structure to Characteristics in Online Collegiate Social Networks
We study the structure of social networks of students by examining the graphs of Facebook “friendships” at five U.S. universities at a single point in time. We investigate the community structure of each single-institution network and employ visual and quantitative tools, including standardized pair-counting methods, to measure the correlations between the network communities and a set of self-...
متن کاملIdentification of community structure in networks with convex optimization
We reformulate the problem of modularity maximization over the set of partitions of a network as a conic optimization problem over the completely positive cone, converting it from a combinatorial optimization problem to a convex continuous one. A semidefinite relaxation of this conic program then allows to compute upper bounds on the maximum modularity of the network. Based on the solution of t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Statistical Mechanics: Theory and Experiment
سال: 2005
ISSN: 1742-5468
DOI: 10.1088/1742-5468/2005/09/p09008